The time to read the input and initialise the problem = 328 ms
The time to create the optimal problem = 0 ms
The time to compute the optimal solution = 94 ms
The optimal solution is:
x11=0
x12=0
x13=0
x14=0
x15=1
x21=0
x22=0
x23=0
x24=0
x25=1
x31=0
x32=0
x33=0
x34=1
x35=0
x41=0
x42=0
x43=0
x44=1
x45=0
x51=0
x52=0
x53=0
x54=0
x55=1
x61=0
x62=0
x63=0
x64=1
x65=0
x71=0
x72=0
x73=0
x74=1
x75=0
x81=0
x82=0
x83=0
x84=0
x85=1
x91=0
x92=0
x93=0
x94=0
x95=1
x101=0
x102=0
x103=0
x104=0
x105=1
y1=0
y2=0
y3=0
y4=1
y5=1
z1=1
z2=0
z3=0
w11=0.000000
w12=0.000000
w13=0.000000
w14=68.000000
w15=114.000000
w21=0.000000
w22=0.000000
w23=0.000000
w24=0.000000
w25=0.000000
w31=0.000000
w32=0.000000
w33=0.000000
w34=0.000000
w35=0.000000
z=37032.000000
The time to read the optimal solution = 0 ms
Run time is 1922 ms
